Bipartite and Series-Parallel Graphs Without Planar Lombardi Drawings
نویسندگان
چکیده
We find a family of planar bipartite graphs all whose Lombardi drawings (drawings with circular arcs for edges, meeting at equal angles the vertices) are nonplanar. also families embedded series-parallel and apex-trees (graphs formed by adding one vertex to tree) which there is no drawing consistent given embedding.
منابع مشابه
Planar Lombardi Drawings for Subcubic Graphs
We prove that every planar graph with maximum degree three has a planar drawing in which the edges are drawn as circular arcs that meet at equal angles around every vertex. Our construction is based on the Koebe–Thurston–Andreev circle packing theorem, and uses a novel type of Voronoi diagram for circle packings that is invariant under Möbius transformations, defined using three-dimensional hyp...
متن کاملPlanar Lombardi Drawings of Outerpaths
A Lombardi drawing of a graph is a drawing where edges are represented by circular arcs that meet at each vertex v with perfect angular resolution 360◦/deg(v) [3]. It is known that Lombardi drawings do not always exist, and in particular, that planar Lombardi drawings of planar graphs do not always exist [1], even when the embedding is not fixed. Existence of planar Lombardi drawings is known f...
متن کاملLombardi Drawings of Graphs
We introduce the notion of Lombardi graph drawings, named after the American abstract artist Mark Lombardi. In these drawings, edges are represented as circular arcs rather than as line segments or polylines, and the vertices have perfect angular resolution: the edges are equally spaced around each vertex. We describe algorithms for finding Lombardi drawings of regular graphs, graphs of bounded...
متن کاملNice Drawings for Planar Bipartite Graphs
Graph drawing algorithms usually attempt to display the characteristic properties of the input graphs. In this paper we consider the class of planar bipartite graphs and try to achieve planar drawings such that the bipartite-ness property is cleary shown. To this aim, we develop several models, give eecient algorithms to nd a corresponding drawing if possible or prove the hardness of the proble...
متن کاملPlanar and Poly-arc Lombardi Drawings
In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi drawing, and not every planar graph has a planar Lombardi drawing. We introduce k-Lombardi drawings, in which each edge may be drawn with k circular arcs, noting that every graph has a smooth 2-Lombardi drawing. We sh...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 2021
ISSN: ['1526-1719']
DOI: https://doi.org/10.7155/jgaa.00571